Minimum sum multicoloring on the edges of planar graphs and partial k-trees ´ Daniel Marx Budapest University of Technology and Economics

Source URL: www.cs.bme.hu

INF562, Lecture 4: Geometric and combinatorial properties of planar graphs 5 janLuca Castelli Aleardi

Source URL: www.enseignement.polytechnique.fr

Injective colorings of planar graphs with few colors ∗ Borut Luˇzar 1 ˇ

Source URL: iti.mff.cuni.cz

Approximate Min-max Relations for Odd Cycles in Planar Graphs Samuel Fiorini1,
, Nadia Hardy2,

, Bruce Reed2,


, and Adrian Vetta2,† 1 GERAD, Montreal, Quebec, Canada and Universit´e Libre de Bruxelles,

Source URL: cgm.cs.mcgill.ca

Simultaneous Embedding of Planar Graphs with Few Bends∗† Cesim Erten and Stephen G. Kobourov Department of Computer Science University of Arizona {cesim,kobourov}@cs.arizona.edu

Source URL: www2.isikun.edu.tr

Efficient Shortest Paths on Massive Social Graphs Xiaohan Zhao, Alessandra Sala, Haitao Zheng and Ben Y. Zhao Department of Computer Science, U. C. Santa Barbara, Santa Barbara, USA {xiaohanzhao, alessandra, htzheng, rav

Source URL: www.cs.ucsb.edu

• Graph theory
• Mathematics
• Discrete mathematics
• Network theory
• Edsger W. Dijkstra
• Network analysis
• Routing algorithms
• Centrality
• Shortest path problem
• Planar graph
• Pathfinding
• Social network analysis

Planar crossing numbers of graphs embeddable in another surface K´aroly J. B¨or¨oczky∗, J´anos Pach† and G´eza T´oth‡ R´enyi Institute, Hungarian Academy of Sciences Abstract

Source URL: www.renyi.hu

C:/Documents and Settings/mishaq01/Desktop/Mashhood/Conference Papers/COCOON 2009/camera ready/cocoon101a.dvi

Source URL: www.eecs.tufts.edu

• Graph theory
• Mathematics
• Graph operations
• Polygons
• Planar graphs
• Graph connectivity
• Dual graph
• Edge
• Graph
• Vertex
• Ear decomposition
• Bridge

The k-disjoint paths problem in directed planar graphs Dániel Marx1 1 Computer and Automation Research Institute, Hungarian Academy of Sciences (MTA SZTAKI) Budapest, Hungary

Source URL: www.cs.bme.hu

A subexponential parameterized algorithm for Subset TSP on planar graphs Philip N. Klein Dániel Marx

Source URL: www.cs.bme.hu